Defining sets in mathematics
نویسندگان
چکیده
We present as examples, some problems which motivate talented undergraduates, or even high school students, to do research in mathematics. These problems are related to the speaker’s research activity. They have been presented in the past to attract very bright students. Here we go through the roots of some of these problems and elaborate the research topics behind them.
منابع مشابه
Separated finitely supported $Cb$-sets
The monoid $Cb$ of name substitutions and the notion of finitely supported $Cb$-sets introduced by Pitts as a generalization of nominal sets. A simple finitely supported $Cb$-set is a one point extension of a cyclic nominal set. The support map of a simple finitely supported $Cb$-set is an injective map. Also, for every two distinct elements of a simple finitely supported $Cb$-set, there exists...
متن کاملClassifying Flexible Factors Using Fuzzy Concept
In Data Envelopment Analysis (DEA), it is assumed that the role of each factor is known asinput or output. However, in some cases, there are shared factors that their input versusoutput status is not clearly known. These are flexible measures. In such cases, determiningwhether a factor is input or output is ambiguous. Therefore, using fuzzy concept seems to benecessary.In this paper, a two phas...
متن کاملA characterization of uniquely vertex colorable graphs using minimal defining sets
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We define a minimal defining set to be a defining set which does not properly contain another defining set. If G is a uniquely vertex colorable graph, clearly its minimum defining sets are of size χ(G) − 1. It is shown that...
متن کاملOn defining sets of directed designs
The concept of defining set has been studied in block designs and, under the name critical sets, in Latin squares and Room squares. Here we study defining sets for directed designs. A t-(v, k,'x) directed design (DD) is a pair (V, B), where V is a v-set and B is a collection of ordered blocks (or k-tuples of V), for which each t-tuple of V appears in precisely ,X blocks. A set of blocks which i...
متن کاملGreedy defining sets in graphs and Latin squares
Greedy algorithm sometimes uses more than χ(G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring results in a minimum coloring of an order graph G. In this note we report some of the previous results as well as new results on greedy defining sets of graphs and Latin squares.
متن کاملMore On λκ−closed sets in generalized topological spaces
In this paper, we introduce λκ−closed sets and study its properties in generalized topological spaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011